https://nova.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:12471 Sat 24 Mar 2018 08:16:30 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:22972 Discrete Math., 101, 33–37 (1992)) has extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has an even factor without isolated vertices. Let me_e > 0 be even and m_o > 0 be odd. In this paper, we prove that every m_e-edge-connected graph with minimum degree at least m_e + 1 contains an even factor with minimum degree at least m_e and every (m_o + 1)-edge-connected graph contains an odd factor with minimum degree at least m_o, which further extends Fleischner’s result. Moreover, we show that our results are best possible.]]> Sat 24 Mar 2018 07:15:20 AEDT ]]>